翻訳と辞書 Words near each other ・ Ramanujacharya (film) ・ Ramanujam vanishing theorem ・ Ramanujam Varatharaja Perumal ・ Ramanujam–Samuel theorem ・ Ramanujan (disambiguation) ・ Ramanujan (film) ・ Ramanujan graph ・ Ramanujan Institute for Advanced Study in Mathematics ・ Ramanujan IT City ・ Ramanujan Mathematical Society ・ Ramanujan prime ・ Ramanujan Prize ・ Ramanujan summation ・ Ramanujan tau function ・ Ramanujan theta function ・ Ramanujan's congruences ・ Ramanujan's lost notebook ・ Ramanujan's master theorem ・ Ramanujan's sum ・ Ramanujan's ternary quadratic form ・ Ramanujan–Nagell equation ・ Ramanujan–Petersson conjecture ・ Ramanujan–Sato series ・ Ramanujan–Soldner constant ・ Ramanujapur ・ Ramanujapuram, Thanjavur ・ Ramanujar (TV series) ・ Ramanujganj ・ Ramapala ・ Ramapati Ram Tripathi Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Ramanujan's congruences ： ウィキペディア英語版 Ramanujan's congruences In mathematics, Ramanujan's congruences are some remarkable congruences for the partition function ''p''(''n''). The Indian mathematician Srinivasa Ramanujan discovered the following : *$p(5k+4)\backslash equiv\; 0\; \backslash pmod\; 5$ : *$p(7k+5)\backslash equiv\; 0\; \backslash pmod\; 7$ : *$p(11k+6)\backslash equiv\; 0\; \backslash pmod\; .$ == Background == In his 1919 paper (Ramanujan, 1919), he gave proof for the first two congruences using the following identities (using q-Pochhammer symbol notation): :$\backslash sum\_^\backslash infty\; p(5k+4)q^k=5\backslash frac$ :$\backslash sum\_^\backslash infty\; p(7k+5)q^k=7\backslash frac+49q\backslash frac.$ then stated that "It appears there are no equally simple properties for any moduli involving primes other than these".〔S. Ramanujan, ''Congruence properties of partitions'', Math. Z. 9 (1921), 147–153.〕 After Ramanujan died in 1920, G. H. Hardy, extracted proofs of all three congruences from an unpublished manuscript of Ramanujan on ''p''(''n'') (Ramanujan, 1921). The proof in this manuscript employs Eisenstein series. In 1944, Freeman Dyson defined the rank function and conjectured the existence of a crank function for partitions that would provide a combinatorial proof of Ramanujan's congruences modulo 11. Forty years later, George Andrews and Frank Garvan successfully found such a function, and proved the celebrated result that the crank simultaneously “explains” the three Ramanujan congruences modulo 5, 7 and 11. Extending results of A. O. L. Atkin, Ken Ono in 2000 proved that there are such Ramanujan congruences modulo every integer coprime to 6. For example, his results give : *$p(4063467631k+30064597)\backslash equiv\; 0\backslash pmod.$ Later Ken Ono conjectured that the elusive crank also satisfies exactly the same types of general congruences. This was proved by his Ph.D. student Karl Mahlburg in his 2005 paper ''Partition Congruences and the Andrews–Garvan–Dyson Crank'', linked below. This paper won the first Proceedings of the National Academy of Sciences Paper of the Year prize. A conceptual explanation for Ramanujan's observation was finally discovered in January 2011 〔Ken Ono, Amanda Folsom, & Zach Kent (2011). l-adic properties of the partition function American Institute of Mathematics.〕 by considering the Hausdorff dimension of the following $P$ function in the l-adic topology: :$P\_l(b;z)\; :=\; \backslash sum\_^\backslash infty\; p\backslash left(\backslash frac\backslash right)q^.$ It is seen to have dimension 0 only in the cases where ''l'' = 5, 7 or 11 and since the partition function can be written as a linear combination of these functions〔Ken Ono & Jan Bruinier (2011). AN ALGEBRAIC FORMULA FOR THE PARTITION FUNCTION American Institute of Mathematics.〕 this can be considered a formalization and proof of Ramanujan's observation. In 2001, R.L. Weaver gave an effective algorithm for finding congruences of the partition function, and tabulated 76,065 congruences.〔R.L. Weaver, ''New congruences for the partition function'', The Ramanujan Journal, 5 (2001), 53-63. ()〕 This was extended in 2012 by F. Johansson to 22,474,608,014 congruences,〔F. Johansson, ''Efficient implementation of the Hardy-Ramanujan-Rademacher formula'', LMS Journal of Computation and Mathematics 15 (2012), 341-359. ()〕 one large example being :$p(28995244292486005245947069k\; +\; 28995221336976431135321047)\; \backslash equiv\; 0\; \backslash pmod.$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ramanujan's congruences」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.